Now showing items 1-2 of 2

  • MAXIMAL AND CONVEX LAYERS OF RANDOM POINT SETS 

    Cuong Nguyen (2017-10-31)
    This thesis studies two well-known geometric structures in computational geometry: maximal points and convex hull. Extending the concepts to multiple maximal and convex layers is natural. We study the maximal and convex ...
  • Range Searching Data Structures with Cache Locality 

    Hamilton, Christopher (2011-04-15)
    This thesis focuses on range searching data structures, an elementary problem in computational geometry with research spanning decades. These problems often involve very large data sets. Processor speeds increase faster ...